ACTIVITY-BASED COSTING FOR VEHICLE ROUTING PROBLEMS
نویسندگان
چکیده
منابع مشابه
Online vehicle routing problems
The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years; two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملA new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to cover all customers while satisfying, for each route, both a capacity and a total-distance-travelled limit. Our starting point is the following refinement procedure proposed in 1981 by Sarvanov and Doroshko for the pure...
متن کاملA Savings Based Method for Real-Life Vehicle Routing Problems
This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on reallife data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing plans of both algorithms according to nonstandard quality measures that help to evaluate the "visual attracti...
متن کاملInteger Programming-Based Heuristics for Vehicle Routing Problems
Title of dissertation: INTEGER PROGRAMMING-BASED HEURISTICS FOR VEHICLE ROUTING PROBLEMS Damon J. Gulczynski Doctor of Philosophy, 2010 Dissertation directed by: Professor Bruce Golden Applied Mathematics and Scientific Computation Robert H. Smith School of Business The vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2012
ISSN: 2224-7890,1012-277X
DOI: 10.7166/21-2-57